Minimum Spanning Tree-based Structural Similarity Clustering for Image Mining with Local Region Outliers
نویسندگان
چکیده
منابع مشابه
Minimum Spanning Tree-based Structural Similarity Clustering for Image Mining with Local Region Outliers
Image mining is more than just an extension of data mining to image domain. Image mining is a technique commonly used to extract knowledge directly from image. Image segmentation is the first step in image mining. We treat image segmentation as graph partitioning problem. In this paper we propose a novel algorithm, Minimum Spanning Tree based Structural Similarity Clustering for Image Mining wi...
متن کاملAlgorithm for Clustering Gene Expression Data with Outliers Using Minimum Spanning Tree
Microarrays enable biologists to study genome-wide patterns of gene expression in any given cell type at any given time and under any given set of conditions. Identifying group of genes that manifest similar expression pattern is important in the analysis of gene expression in time series data. In this paper multidimensional gene expression data is represented using Minimum Spanning Tree (MST)....
متن کاملCluster Validity with Minimum Spanning Tree Based Clustering
Clustering is a process of discovering groups of objects such that the objects of the same group are similar, and objects belonging to different groups are dissimilar. A number of clustering algorithms exist that can solve the problem of clustering, but most of them are very sensitive to their input parameters. Therefore it is very important to evaluate the result of them. The minimum spanning ...
متن کاملImage Registration with Minimum Spanning Tree Algorithm
Registration is a fundamental task in image processing and quite a few registration techniques have been developed in various fields. In this paper we propose a novel graphrepresentation method for image registration with Rényi entropy as the dissimilarity metric between images. The image matching is performed by minimizing the length of the minimum spanning tree (MST) which spans the graph gen...
متن کاملLocal Density-based Hierarchical Clustering for Overlapping Distribution using Minimum Spanning Tree
In this paper, we propose a clustering algorithm to find clusters of different sizes, shapes and densities. Density and Hierarchical based approaches are adopted in the algorithm using Minimum Spanning Tree, resulting in a new algorithm – Local Density-based Hierarchical Clustering Algorithm for overlapping data distribution using Minimum Spanning Tree (LDHCODMST). The algorithm is divided into...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2010
ISSN: 0975-8887
DOI: 10.5120/1211-1737